Search results
134 packages found
Fastest Levenshtein distance implementation in JS.
- levenshtein
- distance
- fast
- fastest
- edit
- string
- similarity
- algorithm
- match
- comparison
- fuzzy
- search
- matching
- similar
- View more
Regular expression for matching ANSI escape codes
easier than regex string matching patterns for urls and other strings. turn strings into data or data into strings.
- url
- string
- matching
- pattern
- routing
- route
- regex
- match
- segment
- parsing
- parser
- parse
- combinator
- combinators
- View more
easier than regex string matching patterns for urls and other strings. turn strings into data or data into strings.
- url
- string
- matching
- pattern
- routing
- route
- regex
- match
- segment
- parsing
- parser
- parse
- combinator
- combinators
- View more
Measure the difference between two strings using the Levenshtein distance algorithm
- leven
- levenshtein
- distance
- algorithm
- string
- difference
- diff
- fast
- fuzzy
- similar
- similarity
- compare
- comparison
- edit
- View more
Checks strings against patterns and collects matched substrings
Pattern matching library
- array
- condition
- match
- matching
- object
- pattern
- pattern-matching
- predicate
- string
- regex
- regular expression
- nested
- deep
- recursive
Trie, Prefix tree. Javascript & Typescript Data Structure.
- Trie
- prefix tree
- prefixtree
- Prefix tree
- prefix-tree
- prefix
- digital tree
- digitaltree
- Digital Tree
- digital-tree
- digital
- radix tree
- radixtree
- Radix Tree
- View more
Intuitive approximate string matching (i.e. fuzzy searches)
Compare two values with various paramaters.
A Node.js package to calculate string similarity.
- string
- matching
- comparison
- similarity
- algorithm
- node
- node.js
- npm
- package
- library
- util
- utility
- tool
- spell correction
- View more
a library for matching human-quality input to a list of potential matches using the Levenshtein distance algorithm
- closest
- compare
- comparison
- didyoumean
- diff
- difference
- distance
- edit
- find
- fuzzy
- leven
- levenshtein
- match
- matching
- View more
Simple wildcard matching
Fastest Levenshtein distance implementation in JS.
- levenshtein
- distance
- fast
- fastest
- edit
- string
- similarity
- algorithm
- match
- comparison
- fuzzy
- search
- matching
- similar
- View more
Qap, a quick parser/matcher optimized for string and buffer patterns (<= 255 bytes).
Ukkonens approximate string matching algorithm for finding edit distance similar to Levenshtein
Powerful string matching insensitive to diacritics, special characters, symbols and case
Yet another javascript fuzzy matching library
Prompt engineering text similarity matchers for Jest